摘要 :
Upper and lower bounds are obtained for the redundancy of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Tight upper bounds on redundancy in terms of the most and least likely s...
展开
Upper and lower bounds are obtained for the redundancy of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Tight upper bounds on redundancy in terms of the most and least likely source letter probabilities are provided.
收起
摘要 :
Prof Bireswar Banerjee the legendary Geographer, the doyen of Indian Geography passed away on 17~(th) of June 2017 after a brief illness. My association with him started in 1977. Prof Banerjee at that time was a senior faculty mem...
展开
Prof Bireswar Banerjee the legendary Geographer, the doyen of Indian Geography passed away on 17~(th) of June 2017 after a brief illness. My association with him started in 1977. Prof Banerjee at that time was a senior faculty member in the Department of Geography, University of Calcutta and by then earned a reputation of being a renowned Geographer nationally and internationally. At that point of time he had been supervising the theses of a large number of Ph D scholars in the Department of Geography, University of Calcutta. I was looking for a Supervisor under whom I could undertake my research work for the degree of Ph D in Geography. As I did not study M.A. from University of Calcutta and not been known to him, it goes without saying that I was extremely nervous and quite unsure whether he would accept me as a scholar who was completely unknown to him. To my great relief he agreed to supervise my Ph D thesis. It is needless to say that it was the beginning of my long association with him for the last four decades.
收起
摘要 :
Several constructions are presented by which spherical codes are generated from groups of binary codes. In the main family of constructions the codes are generated from equally spaced symmetric pointsets on the real line. The main...
展开
Several constructions are presented by which spherical codes are generated from groups of binary codes. In the main family of constructions the codes are generated from equally spaced symmetric pointsets on the real line. The main ideas are code concatenation and set partitioning. Extensive tables are presented for spherical codes in dimension n/spl les/24.
收起
摘要 :
We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embeddi...
展开
We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1) tree fa full binary tree with 2/sup n-1/ nodes) into an n-cube (a hypercube with 2/sup n/ nodes) with unit dilation and load. For the problem where the root of the tree must be mapped to a specified hypercube node (specified root embedding problem), we show that up to n-2 (node or edge) faults can be tolerated. This result is optimal in the following sense: 1) it is time-optimal, 2) (n-1)-tree is the largest fall binary tree that can be embedded in an n-cube, and 3) n-2 faults Is the maximum number of worst-case faults that can be tolerated in the specified root problem. Furthermore, we also show that any algorithm for this problem cannot be totally recursive in nature. For the problem where the root can be mapped to any nonfaulty hypercube node (variable root embedding problem), we show that up to 2n-3-[log n] faults can be tolerated. Thus we have improved upon the previous result of n-1-[log n]. In addition, we show that the algorithm for the variable root embedding problem is optimal within a class of algorithms called recursive embedding algorithms as far as the number of tolerable faults is concerned. Finally, we show that when an O(1spl radic/n) fraction of nodes in the hypercube are faulty, it is not always possible to have an O(1)-load variable root embedding no matter how large the dilation is.
收起
摘要 :
The growing popularity of transmit-arrays (TAs) for various antenna applications is calling for effective analysis and optimization methods. TAs are, usually, electrically large, comprising thousands of unit-cells formed by subwav...
展开
The growing popularity of transmit-arrays (TAs) for various antenna applications is calling for effective analysis and optimization methods. TAs are, usually, electrically large, comprising thousands of unit-cells formed by subwavelength metallic scattere
收起
摘要 :
Bounds on the weight hierarchies of the product of two simplex codes, two first order Reed-Muller codes, and the product of a simplex code and a first-order Reed-Muller code are determined. The weight hierarchies of the product of...
展开
Bounds on the weight hierarchies of the product of two simplex codes, two first order Reed-Muller codes, and the product of a simplex code and a first-order Reed-Muller code are determined. The weight hierarchies of the product of two Hamming codes and the product of a Hamming code and an even-weight code are also discussed.
收起
摘要 :
A mechanism, called views, that allows programmers to specify multiple interfaces for objects and to control explicitly access to each interface is described. This mechanism provides a simple and flexible means of specifying enfor...
展开
A mechanism, called views, that allows programmers to specify multiple interfaces for objects and to control explicitly access to each interface is described. This mechanism provides a simple and flexible means of specifying enforceable access restrictions at many levels of granularity. It also results in system organization that supports browsing based on a number of different criteria. Views is defined, some examples of its uses are given, the impact of views on system organization is discussed, and five approaches to implementing views are outlined.
收起
摘要 :
A method is presented for calculation of the sound field from a rectangular continuous-wave source surrounded by a plane grid baffle. The approach is illustrated for square sources of 0.5, 1, 2, 5, 10, 20, and 100 lambda on a side...
展开
A method is presented for calculation of the sound field from a rectangular continuous-wave source surrounded by a plane grid baffle. The approach is illustrated for square sources of 0.5, 1, 2, 5, 10, 20, and 100 lambda on a side. These results are compared to the sound fields produced by similarly sized circular sources. The beam widths and locations of on-axis minima are similar for the two sources, but the transverse pressure distribution is more uniform in the near-field of the square source. The effects of attenuation on the sound field of a square source are examined.
收起
摘要 :
Congratulations to 2022 IEEE Computer Society Golden Core Award recipient and 2023 President-Elect Candidate Jyotika Athavale, a longstanding IEEE volunteer and IEEE Senior Member who serves as a senior technical leader in automot...
展开
Congratulations to 2022 IEEE Computer Society Golden Core Award recipient and 2023 President-Elect Candidate Jyotika Athavale, a longstanding IEEE volunteer and IEEE Senior Member who serves as a senior technical leader in automotive functional safety at NVIDIA.
收起
摘要 :
Quantitative risk assessments are presented for two radiation-hardened MOSFETs (Harris FSL11A0 and FRL11A0) using an extracted expression, integral flux curves representing different conditions, and experimentally-determined signa...
展开
Quantitative risk assessments are presented for two radiation-hardened MOSFETs (Harris FSL11A0 and FRL11A0) using an extracted expression, integral flux curves representing different conditions, and experimentally-determined signature curves taken at different ion impact angles. The effectiveness of certain parameters including the selected orbit, spacecraft shielding thickness, drain and gate biases, device hardness, and time of exposure are discussed. Failures are studied using normalized Monte Carlo simulations validated by statistical methods. These validated Monte Carlo simulations are then used to extract and present an extracted expression. The concept of a lethal ion rate is discussed. Single event gate rupture (SEGR) failure thresholds at different ion impact angles are measured and reported on the Harris FSL11A0 and FRL11A0 (radiation-hardened vertical MOSFETs having similar layouts but with different SEGR sensitivities). Integral flux curves are presented for various orbits and conditions. Predictions of very early failures are performed using the extracted expression, the integral flux curves, and the new signature curves. Based upon these predictions, the influence of selected parameters are evaluated.
收起
原文获取